Ela Some Results on the Spectral Radii of Trees, Unicyclic, and Bicyclic Graphs
نویسندگان
چکیده
Let ∆(G), ∆ for short, be the maximum degree of a graph G. In this paper, trees (resp., unicyclic graphs and bicyclic graphs), which attain the first and the second largest spectral radius with respect to the adjacency matrix in the class of trees (resp., unicyclic graphs and bicyclic graphs) with n vertices and the maximum degree ∆, where ∆ ≥ n+1 2 (resp., ∆ ≥ n 2 +1 and ∆ ≥ n+3 2 ) are determined. Moreover, it is shown that the spectral radius of a unicyclic graph U (resp., a bicyclic graph B) on n vertices strictly increases with its maximum degree when ∆(U) ≥ 1 9 ( 1 + √ 6n+ 10 )2 (resp., ∆(B) ≥ 1 9 (
منابع مشابه
Some results on the spectral radii of trees, unicyclic and bicyclic graphs
Let ∆(G), ∆ for short, be the maximum degree of a graph G. In this paper, trees (resp., unicyclic graphs and bicyclic graphs), which attain the first and the second largest spectral radius with respect to the adjacency matrix in the class of trees (resp., unicyclic graphs and bicyclic graphs) with n vertices and the maximum degree ∆, where ∆ ≥ n+1 2 (resp., ∆ ≥ n 2 +1 and ∆ ≥ n+3 2 ) are determ...
متن کاملEla Quadratic Forms on Graphs with Application to Minimizing the Least Eigenvalue of Signless Laplacian over Bicyclic Graphs
Given a graph and a vector defined on the graph, a quadratic form is defined on the graph depending on its edges. In order to minimize the quadratic form on trees or unicyclic graphs associated with signless Laplacian, the notion of basic edge set of a graph is introduced, and the behavior of the least eigenvalue and the corresponding eigenvectors is investigated. Using these results a characte...
متن کاملThe maximal total irregularity of some connected graphs
The total irregularity of a graph G is defined as 〖irr〗_t (G)=1/2 ∑_(u,v∈V(G))▒〖|d_u-d_v |〗, where d_u denotes the degree of a vertex u∈V(G). In this paper by using the Gini index, we obtain the ordering of the total irregularity index for some classes of connected graphs, with the same number of vertices.
متن کاملSome results on the ordering of the Laplacian spectral radii of unicyclic graphs
A unicyclic graph is a graph whose number of edges is equal to the number of vertices. Guo Shu-Guang [S.G. Guo, The largest Laplacian spectral radius of unicyclic graph, Appl. Math. J. Chinese Univ. Ser. A. 16 (2) (2001) 131–135] determined the first four largest Laplacian spectral radii together with the corresponding graphs among all unicyclic graphs on n vertices. In this paper, we extend th...
متن کاملEla on the Spectral Radii of Quasi-tree Graphs and Quasi-unicyclic Graphs with K Pendant Vertices∗
A connected graph G = (V, E) is called a quasi-tree graph if there exists a vertex u0 ∈ V (G) such that G−u0 is a tree. A connected graph G = (V, E) is called a quasi-unicyclic graph if there exists a vertex u0 ∈ V (G) such that G− u0 is a unicyclic graph. Set T (n, k) := {G : G is a n-vertex quasi-tree graph with k pendant vertices}, and T (n, d0, k) := {G : G ∈ T (n, k) and there is a vertex ...
متن کامل